Minimization of Average Path Length in BDDs by Variable Reordering
نویسندگان
چکیده
Minimizing the Average Path Length (APL) in a BDD reduces the time needed to evaluate Boolean functions represented by BDDs. This paper describes an efficient heuristic APL minimization procedure based on BDD variable reordering. The reordering algorithm is similar to classical variable sifting with the cost function equal to the APL rather than the number of BDD nodes. The main contribution of our paper is a fast way of updating the APL during the swap of two adjacent variables. Experimental results show that the proposed algorithm effectively minimizes the APL of large MCNC benchmark functions, achieving reductions of up to 47%. For some benchmarks, minimizing APL also reduces the BDD node count.
منابع مشابه
BDD Path Length Minimization Based on Initial Variable Ordering
A large variety of problems in digital system design, combinational optimization and verification can be formulated in terms of operations performed on Boolean functions. The time complexity of Binary Decision Diagram (BDD) representing a Boolean function is directly related to the path length of that BDD. In this paper we present a method to generate a BDD with minimum path length. The Average...
متن کاملOn the Minimization of Longest Path Length for Decision Diagrams
In this paper, we consider the minimization of the longest path length (LPL) for binary decision diagrams (BDDs) and heterogeneous multi-valued decision diagrams (MDDs). Experimental results show that: (1) For many logic functions, node minimization of BDDs also minimizes the LPLs of BDDs. (2) When we use heterogeneous MDDs for representing logic functions and minimize the memory sizes of heter...
متن کاملBinary Decision Diagrams: A Mathematical Model for the Path-Related Objective Functions
This paper describes a mathematical model for all path length parameters (APL: Average Path Length, LPL: Longest Path Length, and SPL: Shortest Path Length) of Binary Decision Diagrams (BDDs). The proposed model is based on an empirical analysis of randomly generated Boolean functions. The formal core of the developed model is a unique equation for the path-related objective functions over the ...
متن کاملOn the Exact Minimization of Path-Related Objective Functions for BDDs
Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis and formal verification. In recent practical applications, BDDs are optimized with respect to new objective functions. In this paper we investigate the exact optimization of BDDs with respect to path-related objectiv...
متن کاملExact and Heuristic Minimization of the . . .
In a decision diagram, the average path length (APL) is the average number of nodes on a path from the root node to a terminal node over all assignments of values to variables. Smaller APL values result in faster evaluation of the function represented by a decision diagram. For some functions, the APL depends strongly on the variable order. In this paper, we propose an exact and a heuristic alg...
متن کامل